Appendix: Conjectures Concerning Proof, Design, and Verification

نویسنده

  • Larry Wos
چکیده

1 Setting the Stage This article focuses on an esoteric but practical use of automated reasoning that may indeed be new to many, especially those concerned primarily with veriica-tion of both hardware and software. Speciically, featured are a discussion and some methodology for taking an existing design|of a circuit, a chip, a program , or the like|and reening and improving it in various ways. (Although the methodology is general and does not require the use of a speciic program, McCune's program OTTER does ooer what is needed. OTTER has played and continues to play the key role in my research, and an interested person can gain access to this program in various ways, not the least of which is through the included CD-ROM in 3].) When success occurs, the result is a new design that may require fewer components, avoid the use of certain costly components, ooer more reliability and ease of veriication, and, perhaps most important, be more eecient in the contexts of speed and heat generation. Although I have minimal experience in circuit design, circuit validation, program synthesis, program veriication, and similar concerns, (at the encouragement of colleagues based on successes to be cited) I present material that might indeed be of substantial interest to manufacturers and programmers. I write this article in part prompted by the recent activities of chip designers that include Intel and AMD, activities heavily emphasizing the proving of theorems. As for my research that appears to me to be relevant, I have made an intense and most prootable study of nding proofs that are shorter 2,3], some that avoid the use of various types of term, some that are far less complex than previously known, and the like. Those results suggest to me a strong possible connection between more appealing proofs (in mathematics and in logic) and enhanced and improved design of both hardware and software. Here I explore diverse conjectures that elucidate some of the possibly fruitful connections. The strongest argument opposed to what I discuss in this article rests on the great amount of money, time, energy, and expertise that has been devoted to design and related activities. Indeed, one might understandably suspect that such ?

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automated Formalisation for Verification of Diagrammatic Models

Software engineering uses models to design and analyse systems. The current state-of-the-art, various forms of model-driven development, uses diagrams with defined abstract syntax but relatively-lose translational approaches to semantics, which makes it difficult to perform rigorous analysis and verification of models. Here, we present work-in-progress on tool support for formal verification of...

متن کامل

Supplement to “ Inference Based on Conditional Moment Inequalities ”

11. Outline . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 12. Supplemental Appendix A . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 12.1. Proof of Theorem 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 12.2. Proof of Theorem 2(a) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ...

متن کامل

Ju n 20 05 Fujita ’ s very ampleness conjecture for singular toric varieties

We present a self-contained combinatorial approach to Fujita’s conjectures in the toric case. Our main new result is a generalization of Fujita’s very ampleness conjecture for toric varieties with arbitrary singularities. In an appendix, we use similar methods to give a new proof of an analogous toric generalization of Fujita’s freeness conjecture due to Fujino.

متن کامل

Canonical Bases of Loop Algebras via Quot Schemes

0. Introduction 1 1. Loop algebras and quantum groups. 3 2. Coherent sheaves and Quot schemes 6 3. Transfer functors 12 4. Induction and restriction functors 15 5. The algebra UA 22 6. Proof of Theorem 5.1 i) 28 7. Harder-Narasimhan filtration 32 8. Some Lemmas. 34 9. Proof of Theorem 5.1.ii) (finite type) 38 10. Proof of Theorem 5.1ii) (tame type) 41 11. Corollaries 48 12. Canonical basis of U...

متن کامل

Logic Program Synthesis via Proof Planning

We propose a novel approach to automating the synthesis of logic programs: Logic programs are synthesized as a by-product of the planning of a verification proof. The approach is a two-level one: At the object level, we prove program verification conjectures in a sorted, first-order theory. The conjectures are of the form ∀args . prog(args ) ↔ spec(args ). At the meta-level, we plan the object-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000